LOWER BOUNDS ON LP QUASI‐NORMS AND THE UNIFORM SUBLEVEL SET PROBLEM

نویسندگان

چکیده

Recently, Steinerberger (Potential Analysis, 2020) proved a uniform inequality for the Laplacian serving as counterpoint to standard sublevel set which is known fail Laplacian. In this paper, we observe that many inequalities of type follow from lower bound on L1 norm, and give an analogous result any linear differential operator, can non-linear operators. We consider bounds L p quasi-norms < 1 stronger property remains weaker than prove heat conclude with some naturally arising questions.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lower bounds on the Münchhausen problem

“The Baron’s omni-sequence”, B(n), first defined by Khovanova and Lewis (2011), is a sequence that gives for each n the minimum number of weighings on balance scales that can verify the correct labeling of n identically-looking coins with distinct integer weights between 1 gram and n grams. A trivial lower bound on B(n) is log3 n, and it has been shown that B(n) is log3 n + O(log log n). In thi...

متن کامل

Easiness Amplification and Uniform Circuit Lower Bounds

We present new consequences of the assumption that time-bounded algorithms can be “compressed” with non-uniform circuits. Our main contribution is an “easiness amplification” lemma for circuits. One instantiation of the lemma says: if n1+ε-time, Õ(n)-space computations have n1+o(1) size (non-uniform) circuits for some ε > 0, then every problem solvable in polynomial time and Õ(n) space has n1+o...

متن کامل

Uniform Circuits, Lower Bounds, and QBF Algorithms

We explore the relationships between circuit complexity, the complexity of generating circuits, and circuit-analysis algorithms. Our results can be roughly divided into three parts: • Lower Bounds Against Medium-Uniform Circuits. Informally, a circuit class is “medium uniform” if it can be generated by an algorithmic process that is somewhat complex but not infeasible. We prove several uncondit...

متن کامل

Bounds for Multilinear Sublevel Sets

The question in the form (1.2) was posed by Li, Tao, Thiele, and this author in [5]. Nonoscillatory inequalities of the form ∫ ∏ j |fj◦`j | . ∏ j ‖fj‖Lpj have been studied in [1],[2]. Oscillatory integral inequalities of this type have been extensively studied for n = 2, where one is dealing with bilinear forms 〈Tλ(f1), f2〉. The associated linear operators Tλ are commonly known as oscillatory i...

متن کامل

Equivalence of some LP-based lower bounds for the Golomb ruler problem

The Golomb Ruler problem consists in finding n integers such that all possible differences are distinct and such that the largest difference is minimum. We review three lower bounds based on linear programming that have been proposed in the literature for this problem, and propose a new one. We then show that these 4 lower bounds are equal. Finally we discuss some computational experience aimin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematika

سال: 2021

ISSN: ['2041-7942', '0025-5793']

DOI: https://doi.org/10.1112/mtk.12076